Введите слово или словосочетание на любом языке 👆
Язык:
Перевод и анализ слов искусственным интеллектом ChatGPT
На этой странице Вы можете получить подробный анализ слова или словосочетания, произведенный с помощью лучшей на сегодняшний день технологии искусственного интеллекта:
- как употребляется слово
- частота употребления
- используется оно чаще в устной или письменной речи
- варианты перевода слова
- примеры употребления (несколько фраз с переводом)
- этимология
Что (кто) такое nondeterministic automaton - определение
Tree automata; Top-down tree automaton; Bottom-up tree automaton; Deterministic tree automaton; Deterministic finite tree automaton; Nondeterministic tree automaton; Nondeterministic finite tree automaton; DFTA; Tree language; Pumping lemma for regular tree languages
![Deterministic finite (string) automaton]] accepting multiples of 3 in binary notation](https://commons.wikimedia.org/wiki/Special:FilePath/DFA example multiplies of 3.svg?width=200 "Deterministic finite (string) automaton]] accepting multiples of 3 in binary notation")
Найдено результатов: 118
nondeterministic automaton
<theory> (Or "probabilistic automaton") An automaton in
which there are several possible actions (outputs and next
states) at each state of the computation such that the overall
course of the computation is not completely determined by the
program, the starting state, and the initial inputs.
See also nondeterministic Turing Machine.
(1996-05-07)
Generalized nondeterministic finite automaton
In the theory of computation, a generalized nondeterministic finite automaton (GNFA), also known as an expression automaton or a generalized nondeterministic finite state machine, is a variation of a
Ω-automaton
VARIATION OF FINITE AUTOMATA THAT RUNS ON INFINITE, RATHER THAN FINITE, STRINGS AS INPUT
Rabin automaton; Parity automaton; Streett automaton; Omega automata; Omega automaton; Stream automaton; Ω-automata; Streett automata
In automata theory, a branch of theoretical computer science, an ω-automaton (or stream automaton) is a variation of finite automata that runs on infinite, rather than finite, strings as input. Since ω-automata do not stop, they have a variety of acceptance conditions rather than simply a set of accepting states.
Input/output automaton
TERM
I/O Automaton; I/O automaton
Input/output automata provide a formal model, applicable in describing most types of asynchronous concurrent system. On its own, the I/O automaton model contains a very basic structure that enables it to model various types of
Tree automaton
A tree automaton is a type of state machine. Tree automata deal with tree structures, rather than the strings of more conventional state machines.
Nondeterministic programming
PROGRAMMING PARADIGM
Nondeterministic language; Nondeterministic Programming; Non-deterministic programming; Nondeterministic program; Non-deterministic program
A nondeterministic programming language is a language which can specify, at certain points in the program (called "choice points"), various alternatives for program flow. Unlike an if-then statement, the method of choice between these alternatives is not directly specified by the programmer; the program must decide at run time between the alternatives, via some general method applied to all choice points.
Pushdown automaton
TYPE OF AUTOMATON
Push-down automaton; Pushdown automata; Stack automaton; Push-Down Automaton; Push-down automata; Push Down Automaton; Push down automaton; Pushdown autonoma; Pushdown transducer; Pushdown Transducer; Two-Stack Push Down Automaton; Nondeterministic pushdown automaton; Pushdown stack
In the theory of computation, a branch of theoretical computer science, a pushdown automaton (PDA) is
cellular automaton
![Los Alamos]] ID badge](https://commons.wikimedia.org/wiki/Special:FilePath/John von Neumann ID badge.png?width=200 "Los Alamos]] ID badge")
![''[[Conus textile]]'' exhibits a cellular automaton pattern on its shell.<ref name=coombs/>](https://commons.wikimedia.org/wiki/Special:FilePath/Textile cone.JPG?width=200 "''[[Conus textile]]'' exhibits a cellular automaton pattern on its shell.<ref name=coombs/>")
![A [[torus]], a toroidal shape](https://commons.wikimedia.org/wiki/Special:FilePath/Torus.png?width=200 "A [[torus]], a toroidal shape")
DISCRETE MODEL STUDIED IN COMPUTABILITY THEORY, MATHEMATICS, PHYSICS, COMPLEXITY SCIENCE, THEORETICAL BIOLOGY AND MICROSTRUCTURE MODELING
Seluler Atomatons; Cellular image processing; Cellular autonoma; Cellular Automata; Cellular Automaton; Celullar automaton; Cellular Automata machine; Cellular robotics; Cell games (cellular automaton); Cellular automata machine; Cellular automota; Cellular automata; Cellular automata in popular culture; Fuzzy cellular automata; Fuzzy cellular automaton; Non-totalistic; Applications of cellular automata; Totalistic cellular automata; Cellular automaton theory; Cellular automatons; Tessellation automata
<algorithm, parallel> (CA, plural "- automata") A regular
spatial lattice of "cells", each of which can have any one of
a finite number of states. The state of all cells in the
lattice are updated simultaneously and the state of the entire
lattice advances in discrete time steps. The state of each
cell in the lattice is updated according to a local rule which
may depend on the state of the cell and its neighbors at the
previous time step.
Each cell in a cellular automaton could be considered to be a
finite state machine which takes its neighbours' states as
input and outputs its own state.
The best known example is J.H. Conway's game of Life.
{FAQ
(http://alife.santafe.edu/alife/topics/cas/ca-faq/ca-faq.html) }.
Usenet newsgroups: news:comp.theory.cell-automata,
news:comp.theory.self-org-sys.
(1995-03-03)
cellular automata
DISCRETE MODEL STUDIED IN COMPUTABILITY THEORY, MATHEMATICS, PHYSICS, COMPLEXITY SCIENCE, THEORETICAL BIOLOGY AND MICROSTRUCTURE MODELING
Seluler Atomatons; Cellular image processing; Cellular autonoma; Cellular Automata; Cellular Automaton; Celullar automaton; Cellular Automata machine; Cellular robotics; Cell games (cellular automaton); Cellular automata machine; Cellular automota; Cellular automata; Cellular automata in popular culture; Fuzzy cellular automata; Fuzzy cellular automaton; Non-totalistic; Applications of cellular automata; Totalistic cellular automata; Cellular automaton theory; Cellular automatons; Tessellation automata
NFA minimization
In automata theory (a branch of theoretical computer science), NFA minimization is the task of transforming a given nondeterministic finite automaton (NFA) into an equivalent NFA that has a minimum number of states, transitions, or both. While efficient algorithms exist for DFA minimization, NFA minimization is PSPACE-complete.
Википедия
Tree automaton
A tree automaton is a type of state machine. Tree automata deal with tree structures, rather than the strings of more conventional state machines.
The following article deals with branching tree automata, which correspond to regular languages of trees.
As with classical automata, finite tree automata (FTA) can be either a deterministic automaton or not. According to how the automaton processes the input tree, finite tree automata can be of two types: (a) bottom up, (b) top down. This is an important issue, as although non-deterministic (ND) top-down and ND bottom-up tree automata are equivalent in expressive power, deterministic top-down automata are strictly less powerful than their deterministic bottom-up counterparts, because tree properties specified by deterministic top-down tree automata can only depend on path properties. (Deterministic bottom-up tree automata are as powerful as ND tree automata.)
